The Solution of McCurley's Discrete Log Challenge

Computing Discrete Logarithms with the General Number Field Sieve

The diiculty in solving the discrete logarithm problem is of extreme cryptographic importance since it is widely used in signature schemes, message encryption, key exchange, authentication and so on ((15], 17], 21], 29] etc.). The General Number Field Sieve (GNFS) is the asymptotically fastest known method to compute discrete logs mod p 18]. With the rst implementation of the GNFS for discrete ...

Minimax Estimator of a Lower Bounded Parameter of a Discrete Distribution under a Squared Log Error Loss Function

The problem of estimating the parameter ?, when it is restricted to an interval of the form , in a class of discrete distributions, including Binomial Negative Binomial discrete Weibull and etc., is considered. We give necessary and sufficient conditions for which the Bayes estimator of with respect to a two points boundary supported prior is minimax under squared log error loss function....

1-Soliton Solution of the Biswas-Milovic Equation With Log Law Nonlinearity

This paper studies the Biswas-Milovic equation with log law nonlinearity. TheGausson solution is obtained by the ansatz method. Subsequently, theconservation laws are derived and the conserved quantities are computed usingthe Gausson solution.

Numerical Solution of Volterra-Fredholm Integral Equations with The Help of Inverse and Direct Discrete Fuzzy Transforms and Collocation Technique

The comparison of two high-order semi-discrete central schemes for solving hyperbolic conservation laws

This work presents two high-order, semi-discrete, central-upwind schemes for computing approximate solutions of 1D systems of conservation laws. We propose a central weighted essentially non-oscillatory (CWENO) reconstruction, also we apply a fourth-order reconstruction proposed by Peer et al., and afterwards, we combine these reconstructions with a semi-discrete central-upwind numerical flux ...